Conditional probability modulates visual search efficiency
نویسندگان
چکیده
We investigated the effects of probability on visual search. Previous work has shown that people can utilize spatial and sequential probability information to improve target detection. We hypothesized that performance improvements from probability information would extend to the efficiency of visual search. Our task was a simple visual search in which the target was always present among a field of distractors, and could take one of two colors. The absolute probability of the target being either color was 0.5; however, the conditional probability-the likelihood of a particular color given a particular combination of two cues-varied from 0.1 to 0.9. We found that participants searched more efficiently for high conditional probability targets and less efficiently for low conditional probability targets, but only when they were explicitly informed of the probability relationship between cues and target color.
منابع مشابه
Probability cueing influences miss rate and decision criterion in visual searches
In visual search tasks, the ratio of target-present to target-absent trials has an important effect on miss rates. The low prevalence effect indicates that we are more likely to miss a target when it occurs rarely rather than frequently. In this study, we examined whether probability cueing modulates the miss rate and the observer's criterion. The results indicated that probability cueing affec...
متن کاملStatistical learning in the past modulates contextual cueing in the future.
Observers' capability to extract statistical regularities from the visual world can facilitate attentional orienting. For instance, visual search benefits from the repetition of target locations by means of probability learning. Furthermore, repeated (old) contexts of nontargets contribute to faster visual search in comparison to random (new) arrangements of nontargets. Chun and Jiang (1998) ca...
متن کاملFast Inference and Learning with Sparse Belief Propagation
Even in trees, exact probabilistic inference can be expensive when the cardinality of the variables is large. This is especially troublesome for learning, because many standard estimation techniques, such as EM and conditional maximum likelihood, require calling an inference algorithm many times. In max-product inference, a standard heuristic for controlling this complexity in linear chains is ...
متن کاملA Novel chaos-based Joint Compression and Encryption scheme using Normalized Conditional Bi-gram Probability
A new approach to enhance the compression performance and execution time of chaos-based joint compression and encryption schemes is proposed. Instead of finding a new method to update the Look-up Table (LUT) in each iteration or using a different method to represent the ciphertext, we use multiple LUTs based on the conditional bi-gram probabilities of two consecutive source symbols occurring in...
متن کامل